Sorting algorithm

Results: 266



#Item
41CS264: Beyond Worst-Case Analysis Lecture #1: Three Motivating Examples∗ Tim Roughgarden† September 22,

CS264: Beyond Worst-Case Analysis Lecture #1: Three Motivating Examples∗ Tim Roughgarden† September 22,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-02 12:29:21
42Knuth’s 0-1-Principle and Beyond Janis Voigtl¨ ander University of Bonn  October 18th, 2010

Knuth’s 0-1-Principle and Beyond Janis Voigtl¨ ander University of Bonn October 18th, 2010

Add to Reading List

Source URL: www.janis-voigtlaender.eu

Language: English - Date: 2016-08-01 05:50:10
43The Round Complexity of Distributed Sorting by Boaz Patt-Shamir Marat Teplitsky Tel Aviv University

The Round Complexity of Distributed Sorting by Boaz Patt-Shamir Marat Teplitsky Tel Aviv University

Add to Reading List

Source URL: www.dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:57
44Practical Massively Parallel Sorting – Basic Algorithmic Ideas Michael Axtmann, Timo Bingmann, Peter Sanders, and Christian Schulz arXiv:1410.6754v1 [cs.DS] 24 Oct 2014

Practical Massively Parallel Sorting – Basic Algorithmic Ideas Michael Axtmann, Timo Bingmann, Peter Sanders, and Christian Schulz arXiv:1410.6754v1 [cs.DS] 24 Oct 2014

Add to Reading List

Source URL: panthema.net

Language: English - Date: 2014-10-27 01:32:39
45How invariants help writing loops Author: Sander Kooijmans Document version: 1.2 Why this document? Did you ever feel frustrated because of a nasty bug in your code? Did

How invariants help writing loops Author: Sander Kooijmans Document version: 1.2 Why this document? Did you ever feel frustrated because of a nasty bug in your code? Did

Add to Reading List

Source URL: gogognome.nl

Language: English - Date: 2016-07-04 14:55:09
46348  IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 5,

348 IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 5,

Add to Reading List

Source URL: pbil.univ-lyon1.fr

Language: English - Date: 2008-10-22 02:35:21
47Algorithms and Data Structures (WS15/16) Example Solutions for Unit 4 Problem 1 A simple algorithm to solve this problem is sorting both sets A and B and then doing a linear scan to check for common elements. We start fr

Algorithms and Data Structures (WS15/16) Example Solutions for Unit 4 Problem 1 A simple algorithm to solve this problem is sorting both sets A and B and then doing a linear scan to check for common elements. We start fr

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-02 15:25:03
48Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗  Christoph Lenzen

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:02
49Evaluation Strategies for Top-k Queries over Memory-Resident Inverted Indexes Marcus Fontoura1∗, Vanja Josifovski2 , Jinhui Liu2 , Srihari Venkatesan2 , Xiangfei Zhu2 , Jason Zien2 1. Google Inc., 1600 Amphitheatre Pkw

Evaluation Strategies for Top-k Queries over Memory-Resident Inverted Indexes Marcus Fontoura1∗, Vanja Josifovski2 , Jinhui Liu2 , Srihari Venkatesan2 , Xiangfei Zhu2 , Jason Zien2 1. Google Inc., 1600 Amphitheatre Pkw

Add to Reading List

Source URL: fontoura.org

Language: English - Date: 2011-08-25 01:23:47
50Microsoft Word - Auditing Algorithms -- Sandvig -- ICA 2014 Data and Discrimination Preconference.docx

Microsoft Word - Auditing Algorithms -- Sandvig -- ICA 2014 Data and Discrimination Preconference.docx

Add to Reading List

Source URL: social.cs.uiuc.edu

Language: English - Date: 2015-10-08 22:46:00